Polynomial programming using multi- homogeneous polynomial continuation
نویسندگان
چکیده
منابع مشابه
Polynomial programming using Groebner Bases
Finding the global optimal solution for a general nonlinear program is a diicult task except for very small problems. In this paper we identify a class of non-linear programming problems called polynomial programming problems (PP). A polynomial program is an optimization problem with a scalar polynomial objective function and a set of polynomial constraints. By using Groebner Bases, we can dete...
متن کاملSolving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize...
متن کاملOmega Polynomial in Polybenzene Multi Tori
The polybenzene units BTX 48, X=A (armchair) and X=Z (zig-zag) dimerize forming “eclipsed” isomers, the oligomers of which form structures of five-fold symmetry, called multi-tori. Multi-tori can be designed by appropriate map operations. The genus of multi-tori was calculated from the number of tetrapodal units they consist. A description, in terms of Omega polynomial, of the two linearly peri...
متن کاملBit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input system under some genericity assumptions. The assumptions essentially imply that the Jacobian matrix of the system under study has maximal rank at the solution ...
متن کاملCMPSm : A Continuation Method for Polynomial Systems
CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for cheater’s homotopy, but it can be also used for linear and polyhedral homotopies. The latest version CMPSm2 of this software, this manual and some numerical examples are availab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90022-p